Infinitely Often Dense Bases of Integers with a Prescribed Representation Function
نویسنده
چکیده
Nathanson constructed bases of integers with a prescribed representation function, then asked how dense they can be. Chen constructed unique representation bases of integers which is infinitely often dense. In this paper, we will see how to construct bases of integers with a prescribed representation function which is infinitely often dense.
منابع مشابه
Infinitely Often Dense Bases for the Integers with a Prescribed Representation Function
Nathanson constructed asymptotic bases for the integers with prescribed representation functions, then asked how dense they can be. We can easily obtain an upper bound using a simple argument. In this paper, we will see this is indeed the best bound when we prescribe an arbitrary representation function.
متن کاملDense sets of integers with prescribed representation functions
Let A be a set of integers and let h ≥ 2. For every integer n, let rA,h(n) denote the number of representations of n in the form n = a1 + · · ·+ah, where ai ∈ A for 1 ≤ i ≤ h, and a1 ≤ · · · ≤ ah. The function rA,h : Z→ N, where N = N∪{0,∞}, is the representation function of order h for A. We prove that every function f : Z → N satisfying lim inf|n|→∞ f(n) ≥ g is the representation function of ...
متن کاملOn the Diophantine Equation x^6+ky^3=z^6+kw^3
Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...
متن کاملA problem on unique representation bases
In this paper we construct a unique representation basis whose growth is more than x1/2−ε for infinitely many positive integers x , which solves a problem posed by Nathanson in [M.B. Nathanson, Unique representation bases for the integers, Acta Arith. 108 (2003) 1–8]. c © 2005 Elsevier Ltd. All rights reserved. MSC: 11B13; 11B34; 11B05 Let A be a set of integers, and let rA(n) = #{(a, b) : a, b...
متن کاملRepresentation Functions of Bases for Binary Linear Forms
Let F (x1, . . . , xm) = u1x1 + · · · + umxm be a linear form with relatively prime integer coefficients u1, . . . , um. For any set A of integers, let F (A) = {F (a1, . . . , am) : ai ∈ A for i = 1, . . . , m}. The representation function associated with the form F is RA,F (n) = card ({(a1, . . . , am) ∈ A m : F (a1, . . . , am) = n}) . The set A is an asymptotic basis with respect to F if RA,...
متن کامل